An Experimental Study of Self-Optimizing Dense Linear Algebra SoftwareKULKARNI, Milind; PINGALI, Keshav.Proceedings of the IEEE. 2008, Vol 96, Num 5, pp 832-848, issn 0018-9219, 17 p.Article

Mobile MPI programs in computational gridsFEMANDES, Rohit; PINGALI, Keshav; STODGHILL, Paul et al.ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming. 2006, pp 22-31, isbn 1-595-93189-9, 1Vol, 10 p.Conference Paper

C³: A system for automating application-level checkpointing of MPI programsBRONEVETSKY, Greg; MARQUES, Daniel; PINGALI, Keshav et al.Lecture notes in computer science. 2004, pp 357-373, issn 0302-9743, isbn 3-540-21199-3, 17 p.Conference Paper

How Much Parallelism is There in Irregular Applications?KULKARNI, Milind; BURTSCHER, Martin; INKULU, Rajasekhar et al.ACM SIGPLAN notices. 2009, Vol 44, Num 4, pp 3-14, issn 1523-2867, 12 p.Conference Paper

Optimistic Parallelism Requires AbstractionsKULKARNI, Milind; PINGALI, Keshav; WALTER, Bruce et al.Communications of the ACM. 2009, Vol 52, Num 9, pp 89-97, issn 0001-0782, 9 p.Article

Analytic models and empirical search : A hybrid approach to code optimizationEPSHTEYN, Arkady; GARZARAN, Maria Jesus; DEJONG, Gerald et al.Lecture notes in computer science. 2006, pp 259-273, issn 0302-9743, isbn 3-540-69329-7, 1Vol, 15 p.Conference Paper

Parallel Inclusion-based Points-to AnalysisMENDEZ-LOJO, Mario; MATHEW, Augustine; PINGALI, Keshav et al.ACM SIGPLAN notices. 2010, Vol 45, Num 10, pp 428-443, issn 1523-2867, 16 p.Conference Paper

Optimistic Parallelism Benefits from Data PartitioningKULKARNI, Milind; PINGALI, Keshav; RAMANARAYANAN, Ganesh et al.ACM SIGPLAN notices. 2008, Vol 43, Num 3, pp 233-243, issn 1523-2867, 11 p.Conference Paper

Synthesizing Concurrent Schedulers for Irregular AlgorithmsNGUYEN, Donald; PINGALI, Keshav.ACM SIGPLAN notices. 2011, Vol 46, Num 3, pp 333-344, issn 1523-2867, 12 p.Conference Paper

Optimistic Parallelism Benefits from Data PartitioningKULKARNI, Milind; PINGALI, Keshav; RAMANARAYANAN, Ganesh et al.Operating systems review. 2008, Vol 42, Num 2, pp 233-243, issn 0163-5980, 11 p.Conference Paper

A language for the compact representation of multiple program versionsDONADIO, Sebastien; BRODMAN, James; ROEDER, Thomas et al.Lecture notes in computer science. 2006, pp 136-151, issn 0302-9743, isbn 3-540-69329-7, 1Vol, 16 p.Conference Paper

Structure-driven Optimizations for Amorphous Data-parallel ProgramsMENDEZ-LOJO, Mario; NGUYEN, Donald; PROUNTZOS, Dimitrios et al.ACM SIGPLAN notices. 2010, Vol 45, Num 5, pp 3-14, issn 1523-2867, 12 p.Conference Paper

Optimistic parallelism requires abstractionsKULKARNI, Milind; PINGALI, Keshav; WALTER, Bruce et al.ACM SIGPLAN notices. 2007, Vol 42, Num 6, pp 211-222, issn 1523-2867, 12 p.Conference Paper

The Tao of Parallelism in AlgorithmsPINGALI, Keshav; NGUYEN, Donald; PROUNTZOS, Dimitrios et al.ACM SIGPLAN notices. 2011, Vol 46, Num 6, pp 12-25, issn 1523-2867, 14 p.Conference Paper